The distribution of f(d) (mod 1)
نویسندگان
چکیده
منابع مشابه
NOTES ON PRIMES P ⌘ 1 mod D AND A P � 1 / D ⌘ 1 mod
Let d > 0 be a squarefree integer and a be an integer, which is not 1 nor a square. Let P(a,d)(x) be the number of primes p x such that p ⌘ 1 mod d and a(p 1)/d ⌘ 1 mod p. Numerical data indicate that the function as approximately equal to a constant multiple of ⇡(x)/(d'(d)) for su ciently large x, where ⇡(x) is the number of primes up to x and '(d) is the Euler-' function. The involved const...
متن کاملAkl(fd) { a Concurrent Language for Fd Programming Akl(fd) { a Concurrent Language for Fd Programming
We consider a complete implementation of an extension of the nite domain constraint system FD, including antimonotone constraints, and its integration in AKL, a deep-guard concurrent constraint language. We present the language AKL(FD), together with associated programming techniques. In particular, we show how powerful symbolic constraints can be deened as AKL(FD) programs, which is partly mad...
متن کاملOn Mod (2s+1)-Orientations of Graphs
An orientation of a graph G is a mod (2p+1)-orientation if, under this orientation, the net out-degree at every vertex is congruent to zero mod 2p+1. If, for any function b : V (G) → Z2p+1 satisfying ∑ v∈V (G) b(v) ≡ 0 (mod 2p + 1), G always has an orientation D such that the net outdegree at every vertex v is congruent to b(v) mod 2p + 1, then G is strongly Z2p+1-connected. The graph G′ obtain...
متن کاملOptimal Valve Placement in Water Distribution Networks with CLP(FD)
This paper presents a new application of logic programming to a real-life problem in hydraulic engineering. The work is developed as a collaboration of computer scientists and hydraulic engineers, and applies Constraint Logic Programming to solve a hard combinatorial problem. This application deals with one aspect of the design of a water distribution network, i.e., the valve isolation system d...
متن کاملOn mod (2p+1)-orientations of graphs
It is shown that every (2p+ 1) log2(|V (G)|)-edge-connected graph G has a mod (2p+ 1)orientation, and that a (4p+ 1)-regular graph G has a mod (2p+ 1)-orientation if and only if V (G) has a partition (V , V −) such that ∀U ⊆ V (G), |∂G(U)| ≥ (2p+ 1)||U ∩ V | − |U ∩ V −||. These extend former results by Da Silva and Dahad on nowhere zero 3-flows of 5-regular graphs, and by Lai and Zhang on highl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1976
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-31-1-91-97